t=int(input())
for i in range(t):
n=int(input())
a=3
i=2
while True:
if n%a==0:
print(n//a)
break
else:
a+=2**i
i+=1
// Author :- LAXMI KUMAR SAHANI
#include<bits/stdc++.h>
using namespace std;
#define precise(n) fixed<<setprecision(n)
#define loop(var,start,end) for(int var=start;var<end;var++)
#define input(x) for(auto &i:x) cin>>i;
#define print(x) for(auto i:x) cout<<i<<" ";cout<<"\n";
#define all(x) x.begin(),x.end()
#define mod 1000000007
#define int long long
#define float long double
long double pi = acos(-1);
void solve() {
int n;
cin>>n;
loop(i,2,33){
int temp=pow(2,i);
temp-=1;
if(n%temp==0){
cout<<(n/temp)<<"\n";
return;
}
}
}
int32_t main() {
ios_base::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |